Properly colored notions of connectivity - a dynamic survey
نویسندگان
چکیده
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths. Revision History • Revision 1: December, 2016 • Original: December, 2015 If you have corrections, updates or new results which fit the scope of this work, please contact Colton Magnant at [email protected].
منابع مشابه
Proper connection with many colors
In this work, we consider only edge-colorings of graphs. Since Vizing’s fundamental result [9], proper edge colorings of graphs, colorings such that no two adjacent edges have the same color, have become an essential topic for every beginning graph theorist. Proper edge colorings have many applications in signal transmission [7], bandwidth allocation [3] and many other areas [5, 6, 8]. See [1] ...
متن کاملEvaluation of Model-Based Methods in Estimating Dynamic Functional Connectivity of Brain Regions
Today, neuroscientists are interested in discovering human brain functions through brain networks. In this regard, the evaluation of dynamic changes in functional connectivity of the brain regions by using functional magnetic resonance imaging data has attracted their attention. In this paper, we focus on two model-based approaches, called the exponential weighted moving average model and the d...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملColoring Graphs to Produce Properly Colored Walks
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same color. We show that the proper-walk connection number is at most three for all cyclic graphs, and at most two for bridgeless graphs. We also characterize the bi...
متن کاملA Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کامل